Detecting abnormal events represents an important family of applications for wireless sensor networks. To achieve high\r\nperformance of event detection, a sensor network should stay active most of the time, which is energy inefficient for battery\r\ndriven sensor networks. This paper studies the fundamental problem of bounding detection delays when the sensor network is\r\nlow duty cycled. We propose a novel approach for statistically bounding detection latency for event detection in sensor networks.\r\nThe key issue is the wakeup scheduling of sensor nodes and minimization of wakeup activity.We propose a lightweight distributed\r\nalgorithm for coordinating the wakeup scheduling of the sensor nodes. A distinctive feature of this algorithm is that it ensures that\r\nthe detection delay of any event occurring anywhere in the sensing field is statistically bounded. In addition, the algorithm exposes\r\na convenient interface for users to define the requirement on detection latency, thereby tuning the intrinsic tradeoff between\r\nenergy efficiency and event detection performance. Extensive simulations have been conducted and results demonstrate that this\r\nalgorithm can successfully meet delay bound and significantly reduce energy consumption.
Loading....